A Study on Greedy Algorithms for Ensemble Pruning

نویسندگان

  • Ioannis Partalas
  • Grigorios Tsoumakas
  • Ioannis Vlahavas
چکیده

Ensemble selection deals with the reduction of an ensemble of predictive models in order to improve its efficiency and predictive performance. A number of ensemble selection methods that are based on greedy search of the space of all possible ensemble subsets have recently been proposed. They use different directions for searching this space and different measures for evaluating the available actions at each state. Some use the training set for subset evaluation, while others a separate validation set. This paper abstracts the key points of these methods and offers a general framework of the greedy ensemble selection algorithm, discussing its important parameters and the different options for instantiating these parameters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel ensemble pruning algorithm based on randomized greedy selective strategy and ballot

Although the Directed Hill Climbing Ensemble Pruning (DHCEP) algorithm has achieved favorable classification performance, it often yields suboptimal solutions to the ensemble pruning problem, due to its limited exploration within the whole solution space, which inspires us with the development of a novel Ensemble Pruning algorithm based on Randomized Greedy Selective Strategy and Ballot (RGSS&B...

متن کامل

Microsoft Word - Dr. Li (0795)_TOCSJ.docx

At first the thesis introduces a new concept: coverage-based pattern mining. Then based on this concept, two ensemble pruning algorithms, CPM-EP and PMEP are put forward. By the algorithms we get candidate sub-patterns,and applies coverage pattern mining and a greedy strategy to acquire candidate target ensemble. Experiments show that pattern mining is an efficient selective integration strateg...

متن کامل

Selection of Decision Stumps in Bagging Ensembles

This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble pruning methods are tested. Four of these are greedy strategies based on first reordering the elements of the ensemble according to some rule that takes into account the complementarity of the predictors with respect to the classi...

متن کامل

Ensemble Pruning Via Semi-definite Programming

An ensemble is a group of learning models that jointly solve a problem. However, the ensembles generated by existing techniques are sometimes unnecessarily large, which can lead to extra memory usage, computational costs, and occasional decreases in effectiveness. The purpose of ensemble pruning is to search for a good subset of ensemble members that performs as well as, or better than, the ori...

متن کامل

An efficient ensemble pruning algorithm using One-Path and Two-Trips searching approach

Keywords: Ensemble pruning Backtracking algorithm Ensemble Pruning via BackTracking algorithm (EnPBT) One-Path and Two-Trips searching algorithm (OPTT) Pruning efficiency a b s t r a c t Ensemble pruning is substantial for the successful application of an ensemble system. A novel method for Ensemble Pruning via BackTracking algorithm (EnPBT) was proposed by us in our previous work. Back-trackin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012